Lambek Calculi with 0 and Test–failure in Dpl
نویسنده
چکیده
In Sequoiah-Grayson (2009a), the author gave a basic dynamic semantics the Lambek Calculi, to which a dynamic negation was added. This dynamic negation was interpreted as procedural prohibition, or process exclusion. The resulting framework suggested connections with the analysis of negation as test–failure in the Dynamic Predicate Logic (DPL) due originally to Groenendijk and Stokhof (1991), and developed in van Benthem (1996). The aim of the present article is to explore this connection in detail. keywords: Lambek, negation, test-failure, DPL.
منابع مشابه
Lambek Calculus: Recognizing Power and Complexity
I survey known results and results that easily follow from known results about the recognizing power and complexity of various fragments of the Lambek calculus.
متن کاملParsing CCGbank with the Lambek Calculus
This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We conclude that the Lambek calculus is computationally tractable for this task and provide insight...
متن کاملEfficient Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کاملComparing and evaluating extended Lambek calculi
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a logical theory). However, though it was successful in giving at least a basic treatment of many linguistic phenomena, it was also clear that a slightly more expre...
متن کاملRelational Semantics for the Lambek-Grishin Calculus
We study ternary relational semantics for symmetric versions of the Lambek calculus with interaction principles due to Grishin (1983). We obtain completeness on the basis of a Henkin-style weak filter construction. 1 Background, motivation The categorial calculi proposed by Lambek and their current typelogical extensions respect an “intuitionistic” restriction: in a Gentzen presentation, Lambek...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009